#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 1e6 + 5;

int n, m;
ll a[N];
ll x[N];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  rep(i, 1, n) cin >> a[i];
  ll sum = accumulate(a + 1, a + n + 1, 0ll);
  ll avg = sum / n;
  x[1] = 0;
  rep(i, 1, n - 1) x[i + 1] = a[i] + x[i] - avg;
  sort(x + 1, x + n + 1);
  ll x0 = x[(n + 1) / 2];
  sum = 0;
  rep(i, 1, n) sum += abs(x[i] - x0);
  cout << sum;
  return 0;
}